Analog Computation and Representation
نویسندگان
چکیده
Previous articleNext article No AccessAnalog Computation and RepresentationCorey MaleyCorey Maley Search for more articles by this author PDFPDF PLUS Add to favoritesDownload CitationTrack CitationsPermissionsReprints Share onFacebookTwitterLinkedInRedditEmail SectionsMoreDetailsFiguresReferencesCited The British Journal the Philosophy of Science Just Accepted Society: Society Views: 129Total views on site Article DOIhttps://doi.org/10.1086/715031 HistoryAccepted March 21, 2021 PDF download Crossref reports no citing article.
منابع مشابه
Attractor systems and analog computation
Attractor systems are useful in neurodynamics, mainly in the modeling of associative memory. This paper presents a complexity theory for continuous phase space dynamical systems with discrete or continuous time update, which evolve to attractors. In our framework we associate complexity classes with different types of attractors. Fixed points belong to the class BPPd, while chaotic attractors a...
متن کاملSimulated Analog Computation
This paper describes an approach to solving differential equations based on a block diagram solver. We call this solver Simulated Analog Computer (SAC) because our computational model took inspiration from the structure of the Analog Computers.. The model of analog computation offers an elegant representation of the solution to systems of differential equations encountered in modeling and simul...
متن کاملAnalog Computation of Electrophoresis Patterns.
Instrumentation is described for the computation of stained paper electrophoresis patterns of serum proteins. The unit not only plots the dyed protein fractions, but with its electronic units, stores the individual integration voltages, scales the voltages to a percentage of the total, and plots the data on a bar graph. By including the total protein value obtained by chemical analysis, a secon...
متن کاملThe Complexity of Analog Computation †
We ask if analog computers can solve NP-complete problems efficiently. Regarding this as unlikely, we formulate a strong version of Church’s Thesis: that any analog computer can be simulated efficiently (in polynomial time) by a digital computer. From this assumption and the assumption that P ≠ NP we can draw conclusions about the operation of physical devices used for computation. An NP-comple...
متن کاملAnalog Computation Via Neural Networks
We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a fixed structure, invariant in time, corresponding to an unchanging number of “neurons”. If allowed exponential time for computation, they turn out to have unbounded power. However, under polynomial-time constraints there are limits on their capabilit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The British Journal for the Philosophy of Science
سال: 2021
ISSN: ['0007-0882', '1464-3537']
DOI: https://doi.org/10.1086/715031